The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
نویسندگان
چکیده
منابع مشابه
The s-monotone index selection rules for pivot algorithms of linear programming
In this paper we introduce the concept of s-monotone index selection rule for linear programming problems. We show that several known anticycling pivot rules like the minimal index-, last-in-first-outand themost-often-selected-variable pivot rules are s-monotone index selection rules. Furthermore, we show a possible way to define new s-monotone pivot rules. We prove that several known algorithm...
متن کاملA Homogeneous Model for Monotone Mixed Horizontal Linear Complementarity Problems
We propose a homogeneous model for the class of mixed horizontal linear complementarity problems. The proposed homogeneous model is always solvable and provides the solution of the original problem if it exists, or a certificate of infeasibility otherwise. Our formulation preserves the sparsity of the original formulation and does not reduce to the homogeneous model of the equivalent standard l...
متن کاملA projection algorithm for strictly monotone linear complementarity problems
Complementary problems play a central role in equilibrium finding, physical simulation, and optimization. As a consequence, we are interested in understanding how to solve these problems quickly, and this often involves approximation. In this paper we present a method for approximately solving strictly monotone linear complementarity problems with a Galerkin approximation. We also give bounds f...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملRobust solution of monotone stochastic linear complementarity problems
We consider the stochastic linear complementarity problem (SLCP) involving a random matrix whose expectation matrix is positive semi-definite. We show that the expected residual minimization (ERM) formulation of this problem has a nonempty and bounded solution set if the expected value (EV) formulation, which reduces to the LCP with the positive semi-definite expectation matrix, has a nonempty ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Universitatis Sapientiae, Informatica
سال: 2013
ISSN: 2066-7760
DOI: 10.2478/ausi-2014-0007